BHGSO: Binary Hunger Games Search Optimization Algorithm for Feature Selection Problem

In machine learning and data mining, feature selection (FS) is a traditional and complicated optimization problem. Since the run time increases exponentially, FS is treated as an NP-hard problem. The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios. This paper presents two binary variants of a Hunger Games Search Optimization (HGSO) algorithm based on V- and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset. The proposed technique transforms the continuous HGSO into a binary variant using V- and S-shaped transfer functions (BHGSO-V and BHGSO-S). To validate the accuracy, 16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms. The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features, classification accuracy, run time, and fitness values than other state-of-the-art algorithms. The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems. The proposed BHGSO-V achieves 95% average classification accuracy for most of the datasets, and run time is less than 5 sec. for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.     

一种随机微分对策的Nash平衡

利用动态规划原理和值函数的概念,在Ｉｔｏ微分的意义下讨论了ＩＨＲＳ线性二次型随机控制问题的最优控制率,研究了具有参数的动态系统和具有参数的价值函数的ＩＨＲＳ线性二次型两人非零和随机微分对策,得到了该随机微分对策的Ｎａｓｈ平衡对。     

Variables as Stacks

The development of the dynamic semantics of natural languagehas put issues of variable control on the agenda of formal semantics. Inthis paper we regard variables as names for stacks of values and makeexplicit several control actions as push and pop actions on stacks. Weapply this idea both to static and dynamic languages and compare theirfinite variable hierarchies, i.e., the relation between the number ofvariable stacks that is available and the expressivity of the language.This can be compared in natural languages with relating the number ofpronouns available to the expressivity of the language.The results are obtained using techniques from static and dynamic modeltheory: model theoretic games, transition systems and bisimulation.     

Reduced game property of the Egalitarian Non-k-Averaged Contribution (EN k AC-) value and the Shapley value

The Egalitarian Non- k -Averaged Contribution (EN ^k AC-) value for TU-game represents the equal division of the surplus of the total profits, given that each player is already allocated his individual contribution specified by worths of coalitions of size k . This paper deals with the axiomatic characterization of the EN ^k AC-value on the class of cooperative games with a fixed player set as well as a variable player set. The latter axiomatization involves a consistency axiom in terms of the reduced games. The EN ^k AC-value is the unique value on the class of cooperative games with a variable player set which possesses the relative invariance under strategic equivalence, the equal treatment property and the reduced game property for two types of reduced games. We also propose a new reduced game in terms of which the Shapley value is axiomatized.     

A method for the computational modelling of dialectical argument with dialogue games

In this paper we describe a method for the specification of computationalmodels of argument using dialogue games. The method, which consists ofsupplying a set of semantic definitions for the performatives making upthe game, together with a state transition diagram, is described in full.Its use is illustrated by some examples of varying complexity, includingtwo complete specifications of particular dialogue games, Mackenzie's DC,and the authors' own TDG. The latter is also illustrated by a fully workedexample illustrating all the features of the game.     

基于博弈论的协作中继策略

针对无线网络中协作节点公平、高效的资源分配,提出一种基于博弈论的协作中继策略.设置节点的中继策略为其中继码元数和相应的中继功率,建立中继策略选择的联合博弈(JSPAG)模型.为求解JSPAG的双赢纳什议价解(NBS)策略并降低其运算复杂度,将JSPAG依次分解为码元分配博弈(SAG)和功率分配博弈(PAG).应用凸优化理论,分别证明SAG和PAG具有惟一的纳什议价解;使用低复杂度的策略搜索算法求得SAG和PAG的惟一NBS解.仿真实验表明:与直接传输策略相比,所提出的NBS策略能使协作节点获得公平的数据传输速率增益;与最大化系统速率策略(即不考虑用户间的公平性)相比,NBS策略能在获取节点间公平性的同时减小系统资源利用效率上的损失.     

UCT-RAVE算法在多人非完备信息博弈中的应用

针对传统博弈搜索算法无法适用于多人非完备信息博弈,通过分析UCT-RAVE算法的原理和特性,提出了运用UCT-RAVE算法与蒙特卡罗抽样技术相结合的方法.通过蒙特卡罗抽样技术将非完备信息提取为有一定可信度的完备信息,运用UCT-RAVE算法基于此完备信息进行搜索,结合多次蒙特卡罗抽样下的最佳收益,选择最适行动.实例结果表明了该方法的可行性和有效性.     

不确定性下多主从博弈中均衡的存在性

在已知不确定参数变化范围的假设下,研究多主从博弈中均衡点的存在性问题.基于非合作博弈中NS均衡的定义,提出不确定性下多主从博弈中均衡的概念.基于Fan-Glicksberg不动点定理,证明均衡点的存在性.最后通过算例验证了所提出方法的可行性.     

HTML5游戏开发技巧

随着HTML5技术的日益完善,HTML5在游戏开发领域越来越受欢迎。介绍了实际HTML5游戏开发过程中几个实用的技巧。